Godel on the mathematician's mind and Turing Machine

Godel, Turing, and K-graph machines

Some Mathematicians Are Not Turing Machines

A certain mathematician M, considering some hypothesis H, conclusion C and text P, can arrive at one of the following judgments: (1) P does not convince M of the fact that since H, it follows that C; (2) P is the proof that since H, it follows that C (judgment of the type"Proved"). Is it possible to replace such a mathematician with an arbitrary Turing machine? The paper provides a proof that t...

Alan Turing Universal Turing Machine

In recent years, much research has been devoted to the synthesis of gigabit switches; on the other hand, few have explored the refinement of hash tables. In fact, few cryptographers would disagree with the improvement of the lookaside buffer. In this work, we use signed technology to show that architecture and superblocks are usually incompatible.

After the Turing Machine

Problems in implementing DNA and other types of molecular computers stem from the inherent physical nature of molecules and their reactions. The current theory of computation makes assumptions that at best are very crude approximations of the physical chemistry. A theory which took into account the physical chemistry would likely be very diierent from what we have now and should help in designi...

A Note on Bulk Quantum Turing Machine

Recently, among experiments for realization of quantum computers, NMR quantum computers have achieved the most impressive succession. There is a model of the NMR quantum computation by Atsumi and Nishino’s bulk quantum Turing machine. It assumes, however, an unnatural assumption with quantum mechanics. We, then, define a more natural and quantum mechanically realizable modified bulk quantum Tur...